- construction of a graph
- Техника: построение графика
Универсальный англо-русский словарь. Академик.ру. 2011.
construction of a graph
Смотреть что такое "construction of a graph" в других словарях:
Construction and Analysis of Distributed Processes — Developer(s) the INRIA VASY team Initial release 1986, 24–25 years ago Stable release … Wikipedia
graph — index delineation, design (construction plan), measure Burton s Legal Thesaurus. William C. Burton. 2006 … Law dictionary
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Construction of t-norms — In mathematics, t norms are a special kind of binary operations on the real unit interval [0, 1]. Various constructions of t norms, either by explicit definition or by transformation from previously known functions, provide a plenitude of… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Collaboration graph — In mathematics and social science, a collaboration graph[1][2] is a graph modeling some social network where the vertices represent participants of that network (usually individual people) and where two distinct participants are joined by an edge … Wikipedia
Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia
Hypercube graph — The hypercube graph Q4 Vertices 2n Edges 2n−1n … Wikipedia
Clebsch graph — Named after Alfred Clebsch Vertices 16 Edges 40 … Wikipedia
